Wilf classification of triples of 4-letter patterns II
نویسندگان
چکیده
HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés. Wilf classification of triples of 4-letter patterns II David Callan, Toufik Mansour, Mark Shattuck
منابع مشابه
Wilf classification of triples of 4-letter patterns I
HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau...
متن کاملWilf classification of three and four letter signed patterns
We give some new Wilf equivalences for signed patterns which allow the complete classification of signed patterns of lengths three and four. The problem is considered for pattern avoidance by general as well as involutive signed permutations.
متن کاملOn Eulerian Circuits and Words with Prescribed Adjacency Patterns
In the study of the biochemistry of the DNA molecule [l-3], of the statistical mechanics of large molecules in general [4], and elsewhere, one is led to postulate models of behavior in which the molecule is treated like a “word,” and the individual bases arranged on the molecule are the “letters.” A useful simplifying assumption is then that the informationcarrying properties of these molecules...
متن کاملA New Class of Wilf-Equivalent Permutations
For about 10 years, the classification up to Wilf equivalence of permutation patterns was thought completed up to length 6. In this paper, we establish a new class of Wilf-equivalent permutation patterns, namely, (n −1, n −2, n, τ ) ∼ (n −2, n, n −1, τ ) for any τ ∈ Sn−3. In particular, at level n = 6, this result includes the only missing equivalence (546213) ∼ (465213), and for n = 7 it compl...
متن کاملNew Equivalences for Pattern Avoiding Involutions
We complete the Wilf classification of signed patterns of length 5 for both signed permutations and signed involutions. New general equivalences of patterns are given which prove Jaggard’s conjectures concerning involutions in the symmetric group avoiding certain patterns of length 5 and 6. In this way, we also complete the Wilf classification of S5, S6, and S7 for involutions.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics & Theoretical Computer Science
دوره 19 شماره
صفحات -
تاریخ انتشار 2017